Universal retrieval treesKRICHEVSKY, R. E; RYABKO, B. YA.Discrete applied mathematics. 1985, Vol 12, Num 3, pp 291-302, issn 0166-218XArticle

Comments on batched searching of sequential and tree-structured filesPIWOWARSKI, M.ACM transactions on database systems. 1985, Vol 10, Num 2, pp 285-287, issn 0362-5915Article

Corrections to Parallel game tree-searchMARSLAND, T. A; POPOWICH, F.IEEE transactions on pattern analysis and machine intelligence. 1985, Vol 7, Num 6, pp 748-749, issn 0162-8828Article

Graph embedding in SYNCHEM2, an expert system for organic synthesis discoveryBENSTOCK, J. D; BERNDT, D. J; AGARWAL, K. K et al.Discrete applied mathematics. 1988, Vol 19, pp 45-63, issn 0166-218XArticle

Depth-first iterative-deepening: an optimal admissible tree searchKORF, R. E.Artificial intelligence. 1985, Vol 27, Num 1, pp 97-109, issn 0004-3702Article

Priority search treesMCCREIGHT, E. M.SIAM journal on computing (Print). 1985, Vol 14, Num 2, pp 257-276, issn 0097-5397Article

Self-assessment procedure XIII. A self-assessment procedure dealing with binary search trees and B-treesGUPTA, G. K.Communications of the ACM. 1984, Vol 27, Num 5, pp 435-443, issn 0001-0782Article

Expressions for the number of 2-3 trees with n leavesSHIMIZU, M; NAKAMURA, G.Systems, computers, controls. 1984, Vol 15, Num 5, pp 84-91, issn 0096-8765Article

On the variance of the external path length in a symmetric digital trieKIRSCHENHOFER, P; PRODINGER, H; SZPANKOWSKI, W et al.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 129-143, issn 0166-218X, 15 p.Article

The evaluation of an alternative sum with applications to the analysis of some data structuresSZPANKOWSK, W.Information processing letters. 1988, Vol 28, Num 1, pp 13-19, issn 0020-0190Article

Optimal multiway search trees for variable size keysSZWARCFITER, J. L.Acta informatica. 1984, Vol 21, Num 1, pp 47-60, issn 0001-5903Article

APPROXIMATION ALGORITHMS FOR MINIMUM DATA STORAGE SPACE AND ACCESS TIMEMATSUSHITA H; MARUOKA A; KIMURA M et al.1980; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1980; VOL. 11; NO 4; PP. 50-58; BIBL. 10 REF.Article

THE B^* TREE SEARCH ALGORITHM - NEW RESULTSPALAY AJ.1982; ARTIFICIAL INTELLIGENCE; ISSN 0374-2539; NLD; DA. 1982; VOL. 19; NO 2; PP. 145-163; BIBL. 3 REF.Article

On the joint distribution of the insertion path length and the number of comparisons in search treesMAHMOUD, H. M; PITTEL, B.Discrete applied mathematics. 1988, Vol 20, Num 3, pp 243-251, issn 0166-218XArticle

Jump interpolation search trees and symmetric binary numbersGUNTZER, U; PAUL, M.Information processing letters. 1987, Vol 26, Num 4, pp 193-204, issn 0020-0190Article

Multidimensional search trees that provide new types of memory reductionsWILLARD, D. E.Journal of the Association for Computing Machinery. 1987, Vol 34, Num 4, pp 846-858, issn 0004-5411Article

Rectiminear m-center problemKO, M. T; LEE, R. C. T; CHANG, J. S et al.Naval research logistics. 1990, Vol 37, Num 3, pp 419-427, issn 0894-069X, 9 p.Article

Analysis of the space of search trees under the random insertion algorithmMAHMOUD, H. M; PITTEL, B.Journal of algorithms (Print). 1989, Vol 10, Num 1, pp 52-75, issn 0196-6774, 24 p.Article

The nearest common ancestor in a dynamic treeTSAKALIDIS, A. K.Acta informatica. 1988, Vol 25, Num 1, pp 37-54, issn 0001-5903Article

Accuracy and savings in depth-limited capture searchPRAKASH BETTADAPUR; MARSLAND, T. A.International journal of man-machine studies. 1988, Vol 29, Num 6, pp 497-502, issn 0020-7373Article

Small programming exercises. XIVREM, M.Science of computer programming. 1986, Vol 7, Num 3, pp 313-319, issn 0167-6423Article

Optimal parallel algorithms for constructing and maintaining a balanced m-way search treeDEKEL, E; SHIETUNG PENG; SITHARMA IYENGAR, S et al.International journal of parallel programming. 1986, Vol 15, Num 6, pp 503-528, issn 0885-7458Article

The node visit cost of brother treesKLEIN, R; WOOD, D.Information and computation (Print). 1987, Vol 75, Num 2, pp 107-129, issn 0890-5401Article

Characterization and recognition of partial 3-treesARNBORG, S; PROSKUROWSKI, A.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 2, pp 305-314, issn 0196-5212Article

Lattice path combinatorics and linear probingMENDELSON, H.Journal of statistical planning and inference. 1986, Vol 14, Num 1, pp 79-93, issn 0378-3758Article